Hypercube Networks - III
نویسنده
چکیده
1. Review of the previous lecture This section highlights the problem of routing a hard problem on the butterfly network. 2. Valiant’s Algorithm This section describes the idea behind Valiant’s algorithm for solving a hard problem on the butterfly network. 3. Ranade’s Algorithm This section briefly introduces Ranade’s algorithm. 4. Shuffle-exchange graph This section explains the properties of the Shuffle-exchange graph. 5. DeBruijn Network This section introduces the DeBruijn Network, and illustrates the DeBruijn sequence with the aid of a card trick. 6. Bisection Width for Shuffle-Exchange graph This section provides the proof for deriving the bisection width for the shuffle-exchange graph.
منابع مشابه
Hypercube Bivariate-Based Key Management for Wireless Sensor Networks
Wireless sensor networks are composed of very small devices, called sensor nodes,for numerous applications in the environment. In adversarial environments, the securitybecomes a crucial issue in wireless sensor networks (WSNs). There are various securityservices in WSNs such as key management, authentication, and pairwise keyestablishment. Due to some limitations on sensor nodes, the previous k...
متن کاملMultiple Reduced Hypercube(MRH): A New Interconnection Network Reducing Both Diameter and Edge of Hypercube
In this paper, Multiple Reduced Hypercube(MRH), which is a new interconnection network based on a hypercube interconnection network, is suggested. Also, this paper demonstrates that MRH(n) proposed in this study is superior to the previously proposed hypercube interconnection networks and the hypercube transformation interconnection networks in terms of network cost(diameter x degree). In addit...
متن کاملPairwise Key Establishment Scheme for Hypercube-based Wireless Sensor Networks
-When designing wireless sensor networks, the process of establishing and distributing the secret keys securely and efficiently is very challenging due to the unpredictable network topology. Recently, hypercube virtual backbone approach has been used to provide efficient data gathering schemes for the wireless sensor networks. The hypercube attractive structure and topological properties provid...
متن کاملA Design Methodology for Three - dimensional Space - invariant Hypercube Networks Using Graph Bipartitioning
We present a new design methodology for constructing three-dimensional space-invariant hypercube interconnection networks. The methodology is based on a graph bipartitioning technique and allows the construction of larger hypercube networks from smaller networks in a systematic and incremental fashion. Due to its totally space-invariant nature, the resulting three-dimensional hypercube networks...
متن کاملFault-Tolerant Cycle Embedding in Restricted Hypercube-like Networks with More Faulty Nodes
The hypercube-like networks are a class of important generalization of the popular hypercube interconnection networks for parallel computing. This paper is concerned with the fault-tolerant cycle embedding ability of a subclass of hypercube-like networks, called restricted hypercube-like networks (RHLNs, for short), which include most of the well-known hypercube variants, such as the twisted cu...
متن کاملA Class of Hypercube-Like Networks
W e introduce a class of graphs which are variants of t h e hypercube graph. M a n y of the properties of this class of graphs are s imilar t o tha t of the hypercube hence, we refer t o t h e m as t h e class of Hypercube-Like ( H L ) graphs/networks. W e show that the hypercube, t h e twisted n-cube [l] and the multiply-twisted cube [2] are members of this class of graphs. W e also propose s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004